Relational Specification of Surface Subdivision Algorithms

نویسندگان

  • Colin Smith
  • Przemyslaw Prusinkiewicz
  • Faramarz Samavati
چکیده

Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. We address this discrepancy by defining a set of local operations on polygon meshes in relational, index-free terms. We also introduce the vv programming language to express these operations in a machine-readable form. We then apply vv to specify several surface subdivision algorithms. These specifications can be directly executed by the corresponding modeling software.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Numerical Subdivision Methods in Motion Planning

We propose to design new algorithms for motion planning problems based on the Domain Subdivision paradigm, but coupled with numerical primitives. Although weaker than exact algebraic primitives, our primitives are safe and are exact in the limit. Our algorithms are practical, easy to implement, and have adaptive complexity. A simple but useful example of our approach is presented here. In contr...

متن کامل

Local Specification of Surface Subdivision Algorithms

Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their specification unnecessarily complex, especially if the mesh topology is modified dynamically. We address these problems by defining a set of local operations on polygon meshes represented by graph rotation systems. We als...

متن کامل

Path Planning for Simple Robots using Soft Subdivision Search

The concept of ε-exact path planning is a theoretically sound alternative to the standard exact algorithms, and provides much stronger guarantees than probabilistic or sampling algorithms. It opens the way for the introduction of soft predicates in the context of subdivision algorithm. Taking a leaf from the great success of the Probabilistic Road Map (PRM) framework, we formulate an analogous ...

متن کامل

A Novel Optimized Subdivision Algorithm for Modeling and Animation

Subdivision surfaces are rapidly gaining popularity in computer graphics, modeling, simulation and animation. Existing of subdivision algorithms is suffer from the lack of precise definition of the schemes with guaranteed behavior for a sufficiently general type of control meshes, non-smoothness due to the existence of regular and nonregular face types during the subdivision process and incapab...

متن کامل

Matrix-valued 4-point spline and 3-point non-spline interpolatory curve subdivision schemes

The objective of this paper is to study and construct matrix-valued templates for interpolatory curve subdivision. Since our investigation of this problem was motivated by the need of such subdivision stencils as boundary templates for interpolatory surface subdivision, we provide both spline and non-spline templates that are necessarily symmetric, due to the lack of direction-orientation in ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003